//
// Created by daiyizheng on 2022/3/27.
//
#include <iostream>
using namespace std;
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
bool hasPathSum(TreeNode* root, int targetSum) {
    if (root== nullptr) return false;

    if(root->left== nullptr && root->right== nullptr){
        return targetSum-root->val==0;
    }

    bool leftHaspathSum = hasPathSum(root->left, targetSum-root->val);

    bool rightHasSum = hasPathSum(root->right, targetSum-root->val);

    return leftHaspathSum || rightHasSum;
}